The minimal components of the Mayr-Meyer ideals
نویسندگان
چکیده
rifi such that each ri has degree at most deg f+(kd) n). Mayr and Meyer in [MM] found (generators) of a family of ideals for which a doubly exponential bound in n is indeed achieved. Bayer and Stillman [BS] showed that for these Mayr-Meyer ideals any minimal generating set of syzygies has elements of doubly exponential degree in n. Koh [K] modified the original ideals to obtain homogeneous quadric ideals with doubly exponential syzygies and ideal membership equations. Bayer, Huneke and Stillman asked whether the doubly exponential behavior is due to the number of minimal and/or associated primes, or to the nature of one of them? This paper examines the minimal components and minimal primes of the Mayr-Meyer ideals. In particular, in Section 2 it is proved that the intersection of the minimal components of the Mayr-Meyer ideals does not satisfy the doubly exponential property, so that the doubly exponential behavior of the Mayr-Meyer ideals must be due to the embedded primes. The structure of the embedded primes of the Mayr-Meyer ideals is examined in [S2]. There exist algorithms for computing primary decompositions of ideals (see GianniTrager-Zacharias [GTZ], Eisenbud-Huneke-Vasconcelos [EHV], or Shimoyama-Yokoyama [SY]), and they have been partially implemented on the symbolic computer algebra programs Singular and Macaulay2. However, the Mayr-Meyer ideals have variable degree and a variable number of variables over an arbitrary field, and there are no algorithms to deal with this generality. Thus any primary decomposition of the Mayr-Meyer ideals has to be accomplished with traditional proof methods. Small cases of the primary decomposition analysis were partially verified on Macaulay2 and Singular, and the emphasis here is on “partially”: the computers quickly run out of memory. The Mayr-Meyer ideals are binomial, so by the results of Eisenbud-Sturmfels in [ES] all the associated primes themselves are also binomial ideals. It turns out that many minimal primes are even monomial, which simplifies many of the calculations. The Mayr-Meyer ideals depend on two parameters, n and d, where the number of
منابع مشابه
The First Mayr-meyer Ideal
This paper gives a complete primary decomposition of the first, that is, the smallest, Mayr-Meyer ideal, its radical, and the intersection of its minimal components. The particular membership problem which makes the Mayr-Meyer ideals’ complexity doubly exponential in the number of variables is here examined also for the radical and the intersection of the minimal components. It is proved that f...
متن کاملThe First Mayr - Meyer
This paper gives a complete primary decomposition of the rst, that is, the smallest, Mayr-Meyer ideal, its radical, and the intersection of its minimal components. The particular membership problem which makes the Mayr-Meyer ideals' complexity doubly exponential in the number of variables is here examined also for the radical and the intersection of the minimal components. It is proved that for...
متن کاملPrimary decomposition of the Mayr-Meyer ideals
Grete Hermann proved in H] that for any ideal I in an n-dimensional polynomial ring over the eld of rational numbers, if I is generated by polynomials f 1 ; : : : ; f k of degree at most d, then it is possible to write f = P r i f i such that each r i has degree at most deg f + (kd) (2 n). Mayr and Meyer in MM] found (generators) of ideals for which a doubly exponential bound in n is indeed ach...
متن کاملA new family of ideals with the doubly exponential ideal membership property
Mayr and Meyer [MM] found ideals with the doubly exponential ideal membership property. Further investigations of the doubly exponential properties of these ideals can be found in Bayer and Stillman [BS], Demazure [D], and Koh [K]. Following a question of Bayer, Huneke and Stillman, the author has investigated in [S1, S2, S3] the properties of the primary decompositions and the associated prime...
متن کاملOn the embedded primes of the Mayr-Meyer ideals
Table of contents: Section 1. Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Section 2. Sixteen embedded components . . . . . . . . . . . . . . . . . . . . 5 Section 3. 15(d+ 1) more embedded primes (plus d − d if n = 2) . . . . . . . . 7 Section 4. (n− 1)(d − d) more embedded primes, for n > 2 . . . . . . . . . . 11 Section 5. Reduction to another family . . . . . . ....
متن کامل